Augmented Ring Networks
نویسندگان
چکیده
ÐWe study four augmentations of ring networks which are intended to enhance a ring's efficiency as a communication medium significantly, while increasing its structural complexity only modestly. Chordal rings add ashortcuto edges, which can be viewed as chords, to the ring. Express rings are chordal rings whose chords are routed outside the ring. Multirings append subsidiary rings to edges of a ring and, recursively, to edges of appended subrings. Hierarchical ring networks (HRN's) append subsidiary rings to nodes of a ring and, recursively, to nodes of appended subrings. We show that these four modes of augmentation are very closely related: 1) Planar chordal rings, planar express rings, and multirings are topologically equivalent families of networks with the acutwidtho of an express ring translating into the atree deptho of its isomorphic multiring and vice versa. 2) Every depth-d HRN is a spanning subgraph of a depth- 2dÿ 1 multiring. 3) Every depth-d multiring M can be embedded into a d-dimensional mesh with dilation 3 in such a way that some node of M resides at a corner of the mesh. 4) Every depth-d HRN H can be embedded into a d-dimensional mesh with dilation 2 in such a way that some node of H resides at a corner of the mesh. In addition to demonstrating that these four augmented ring networks are grid graphs, our embedding results afford us close bounds on how much decrease in diameter is achievable for a given increase in structural complexity for the networks. Specifically, we derive upper and lower bounds on the optimal diameters of N-node depth-d multirings and HRNs that are asymptotically tight for large N and d. Index TermsÐRing networks, chordal rings, express rings, multirings, hierarchical ring networks, grid graphs, graph embedding, diameter trade-offs.
منابع مشابه
Dynamic Sliding Mode Control of Nonlinear Systems Using Neural Networks
Dynamic sliding mode control (DSMC) of nonlinear systems using neural networks is proposed. In DSMC the chattering is removed due to the integrator which is placed before the input control signal of the plant. However, in DSMC the augmented system is one dimension bigger than the actual system i.e. the states number of augmented system is more than the actual system and then to control of such ...
متن کاملAn Efficient Fault Tolerant Approach to Resource Discovery in P2P Networks
Current research into resource discovery in peer-topeer networks is largely focussed on the use of Distributed Hash Tables and multi-layered topologies. In this paper we present a resource discovery system capable of resolving keyword-value pair queries, based on a two-layered Chord ring architecture. We show how the base topology augmented with shortcuts between layers and selection of ring me...
متن کاملAddress-Independent Routing for Local Networks
A routing methodology is introduced which permits messages to be propagated throughout a network without recourse to destination or origin addresses. Two classes of networks, bidirectional trees and augmented rings, are analyzed from this point of view. An optimality property is proved for the bidirectional tree, and three types of address-independent routing strategies are derived. It is shown...
متن کاملAssessment of DSACC and QPART Algorithms in Ad Hoc Networks
The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...
متن کاملGreedy Routing on Augmented Ring Graphs
Random ring-based overlay networks have been used to study the small world phenomenon and model fault-tolerant peer-to-peer systems [7]. It has been shown that when each of n nodes has ` = O(logn) links, assigning contacts according to an inverse power-law distance distribution allows greedy routing to perform in O(log n/`) steps [1]. In this paper, we generalize this result by showing the same...
متن کامل